#pragma warning(disable : 4996)
#include"sort.h"
void TestOP()
{
	srand(time(0));
	const int N = 1000000;
	int*temp= (int*)malloc(sizeof(int) * N);
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	int* a7 = (int*)malloc(sizeof(int) * N);
	int* a8 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		a7[i] = a1[i];
		a8[i] = a1[i];
	}

	int begin1 = clock();
	//InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	//SelectSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	//HeapSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	//QuickSortNonR(a5, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	//MergeSort(a6, 0,N-1,temp);
	MergeSortNonR(a6, N);
	int end6 = clock();
	int begin7 = clock();
	//BubbleSort(a7, N);
	PartSort2(a7, 0, N - 1);
	int end7 = clock();
	int begin8 = clock();
	CountSort(a8, N);
	int end8 = clock();

	printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	printf("BubbieSort:%d\n", end7 - begin7);
	printf("CoutSort:%d\n", end8 - begin8);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
	free(a5);
	free(a6);
	free(a7);
	free(a8);
}
int main()
{
	int arr[] = {44,66,55,22,11,33,44,88};
	int tt[] = { 1,2,3,4,5 };
	//InsertSort(arr, sizeof(arr) / sizeof(int));
	//ShellSort(arr, sizeof(arr) / sizeof(int));
	//SelectSort(arr, 9);
	//HeapSort(arr, 9);
	//BubbleSort(tt, 5);
	TestOP();
	//PartSort1(arr, 0, 8);
	//PartSort3(arr, 0, 8);
	//QuickSortNonR(arr, 0, 8);
	//int temp[7] = { 0 };
	//MergeSort(arr, 0, 6, temp);
	//MergeSortNonR(arr, sizeof(arr) / sizeof(int));
	//CountSort(arr, sizeof(arr) / sizeof(int));
}